Efficiency Limits for Value-Deviation-Bounded Approximate Communication
نویسندگان
چکیده
منابع مشابه
Probabilistic Value-Deviation-Bounded Integer Codes for Approximate Communication
M computing systems are designed to prevent errors in computation, memory, and communication. Guarding against errors however requires energy, temporal redundancy, or spatial redundancy and therefore consumes resources. But not all systems need to be free of errors: In some systems, either by explicit design or by the nature of the problems they solve, system output quality degrades gracefully ...
متن کاملValue-Deviation-Bounded Serial Data Encoding for Energy-Efficient Approximate Communication
Transferring data between ICs accounts for a growing proportion of system power in wearable and mobile systems. Reducing signal transitions reduces the dynamic power dissipated in this data transfer, but traditional approaches cannot be applied when the transfer interfaces are serial buses. To address this challenge, we present a family of optimal value-deviation-bounded approximate serial enco...
متن کاملBounded Approximate Character Amenability of Banach Algebras
The bounded approximate version of $varphi$-amenability and character amenability are introduced and studied. These new notions are characterized in several different ways, and some hereditary properties of them are established. The general theory for these concepts is also developed. Moreover, some examples are given to show that these notions are different from the others. Finally, bounded ap...
متن کاملLarge Deviation Methods for Approximate Probabilistic Inference
We study two-layer belief networks of binary random variables in which the conditional probabilities Pr[childjparents] depend monotonically on weighted sums of the parents. In large networks where exact probabilistic inference is intractable, we show how to compute upper and lower bounds on many probabilities of interest. In particular, using methods from large deviation theory, we derive rigor...
متن کاملApproximate Bounded Indistinguishability
Two distributions over n-bit strings are (k, δ)-wise indistinguishable if no statistical test that observes k of the n bits can tell the two distributions apart with advantage better than δ. Motivated by secret sharing and cryptographic leakage resilience, we study the existence of pairs of distributions that are (k, δ)-wise indistinguishable, but can be distinguished by some function f of suit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Embedded Systems Letters
سال: 2015
ISSN: 1943-0663,1943-0671
DOI: 10.1109/les.2015.2475216